Conformal Transformations and Quantum Gravity

Recently\cite{BQG}, it was shown that quantum effects of matter could be identified with the conformal degree of freedom of the space-time metric. Accordingly, one can introduce quantum effects either by making a scale transformation (i.e. changing the metric), or by making a conformal transformation (i.e. changing all physical quantities). These two ways are investigated and compared. Also, it is argued that, the ultimate formulation of such a quantum gravity theory should be in the framework of the scalar-tensor theories.Comment: 8 pages, RevTe

Scalar-Tensor Theories and Quantum Gravity

Recently, it was shown that the quantum effects of the matter, could be used to determine the conformal degree of freedom of the space-time metric. So both gravity and quantum are geometrical features. Gravity determines the causal structure of the space-time, while quantum determines the scale of the space-time. In this article, it is shown that it is possible to use the scalar-tensor framework to build a unified theory in which both quantum and gravitational effects are present.Comment: 12 pages, RevTe

Vertex Disjoint Path in Upward Planar Graphs

The $k$-vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time for every fixed $k$ when restricted to the class of planar digraphs and it was a long standing open question whether it is fixed-parameter tractable (with respect to parameter $k$) on this restricted class. Only recently, \cite{CMPP}.\ achieved a major breakthrough and answered the question positively. Despite the importance of this result (and the brilliance of their proof), it is of rather theoretical importance. Their proof technique is both technically extremely involved and also has at least double exponential parameter dependence. Thus, it seems unrealistic that the algorithm could actually be implemented. In this paper, therefore, we study a smaller class of planar digraphs, the class of upward planar digraphs, a well studied class of planar graphs which can be drawn in a plane such that all edges are drawn upwards. We show that on the class of upward planar digraphs the problem (i) remains NP-complete and (ii) the problem is fixed-parameter tractable. While membership in FPT follows immediately from \cite{CMPP}'s general result, our algorithm has only single exponential parameter dependency compared to the double exponential parameter dependence for general planar digraphs. Furthermore, our algorithm can easily be implemented, in contrast to the algorithm in \cite{CMPP}.Comment: 14 page

Causal loop quantum cosmology in momentum space

We shall show that it is possible to make a causal interpretation of loop quantum cosmology using the momentum as the dynamical variable. We shall show that one can derive Bohmian trajectories. For a sample cosmological solution with cosmological constant, the trajectory is plotted.Comment: 21 pages, 2 figures. To appear in Int. J. Mod. Phys. D, 200